Algorithmic Aspects of Uncertainty Driven Scheduling
نویسندگان
چکیده
In this paper we discuss the algorithmic aspects of uncertainty driven scheduling which is a new design paradigm. Slack oriented design flow could be used to address the uncertainty problem in high level synthesis. We formalize the concept of slack and discuss different variations of the slack driven scheduling problem.
منابع مشابه
Scheduling Post-Distribution Cross-Dock under Demand Uncertainty
The system of distribution of goods and services, along with other economic developments around the world, is rapidly evolving. In the world of distribution of goods, the main focus is on making distribution operations more effective. Due to the fact that the cross-dock has the advantage of removing intermediaries and reducing the space required for the warehouse, it is worth considering. Among...
متن کاملRobust production scheduling in open-pit mining under uncertainty: a box counterpart approach
Open-Pit Production Scheduling (OPPS) problem focuses on determining a block sequencing and scheduling to maximize Net Present Value (NPV) of the venture under constraints. The scheduling model is critically sensitive to the economic value volatility of block, block weight, and operational capacity. In order to deal with the OPPS uncertainties, various approaches can be recommended. Robust opti...
متن کاملEvent-driven and Attribute-driven Robustness
Over five decades have passed since the first wave of robust optimization studies conducted by Soyster and Falk. It is outstanding that real-life applications of robust optimization are still swept aside; there is much more potential for investigating the exact nature of uncertainties to obtain intelligent robust models. For this purpose, in this study, we investigate a more refined description...
متن کاملOn the complexity of single machine scheduling problems under scenario - based uncertainty 1
We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present al...
متن کاملA Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty
It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...
متن کامل